Commuting traces of biadditive mappings, commutativity-preserving mappings and Lie mappings

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Commuting semigroups of holomorphic mappings

Let S1 = {Ft}t≥0 and S2 = {Gt}t≥0 be two continuous semigroups of holomorphic self-mappings of the unit disk ∆ = {z : |z| < 1} generated by f and g, respectively. We present conditions on the behavior of f (or g) in a neighborhood of a fixed point of S1 (or S2), under which the commutativity of two elements, say, F1 and G1 of the semigroups implies that the semigroups commute, i.e., Ft◦Gs = Gs◦...

متن کامل

Filtration-preserving mappings and centralizers within graded Lie algebras

We indicate how centralizers of elements within one-parameter matrix Lie algebras can be computed by means of spectral sequences. The method is algorithmic, and amenable to computer implementation. However, the basic ideas are not specific to the matrix case. So far as seems reasonable, we keep the presentation at a more general level, working within graded Lie algebras and completions thereof....

متن کامل

- Inner Product Preserving Mappings

A mapping f : M → N between Hilbert C∗-modules approximately preserves the inner product if ‖〈f(x), f(y)〉 − 〈x, y〉‖ ≤ φ(x, y), for an appropriate control function φ(x, y) and all x, y ∈ M. In this paper, we extend some results concerning the stability of the orthogonality equation to the framework of Hilbert C∗modules on more general restricted domains. In particular, we investigate some asympt...

متن کامل

Unit-circle-preserving mappings

If f is an isometry, then every distance r > 0 is conserved by f , and vice versa. We can now raise a question whether each mapping that preserves certain distances is an isometry. Indeed, Aleksandrov [1] had raised a question whether a mapping f : X → X preserving a distance r > 0 is an isometry, which is now known to us as the Aleksandrov problem. Without loss of generality, we may assume r =...

متن کامل

Mappings preserving regular hexahedrons

for all x, y ∈ X . A distance r > 0 is said to be preserved (conservative) by a mapping f : X → Y if ‖ f (x)− f (y)‖ = r for all x, y ∈ X with ‖x− y‖ = r. If f is an isometry, then every distance r > 0 is conservative by f , and conversely. We can now raise a question whether each mapping that preserves certain distances is an isometry. Indeed, Aleksandrov [1] had raised a question whether a ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1993

ISSN: 0002-9947,1088-6850

DOI: 10.1090/s0002-9947-1993-1069746-x